Characterization of curve map graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skew-Frobenius map on twisted Edwards curve

In this paper, we consider the Frobenius endomorphism on twisted Edwards curve and give the characteristic polynomial of the map. Applying the Frobenius endomorphism on twisted Edwards curve, we construct a skew-Frobenius map defined on the quadratic twist of an twisted Edwards curve. Our results show that the Frobenius endomorphism on twisted Edwards curve and the skew-Frobenius endomorphism o...

متن کامل

Image/Map Correspondence Using Curve Matching†

We address the general practical problem of determining correspondences between maps and terrain images, and focus on a static low altitude airborne scenario. For this case we consider the approach of partially matching detected and expected curves in the image plane. Expected curves are generated from a map, using an estimate of the sensor pose in three dimensions, and matched with simulated d...

متن کامل

Classes and Recognition of Curve Contact Graphs,

Contact graphs are a special kind of intersection graphs of geometrical objects in which the objects are not allowed to cross but only to touch each other. Contact graphs of simple curves, and line segments as a special case, in the plane are considered. Various classes of contact graphs are introduced and the inclusions between them are described, also the recognition of the contact graphs is ...

متن کامل

Uniform Hyperbolicity of the Curve Graphs

We show that there is a universal constant, k, such that the curve graph associated to any compact orientable surface is k-hyperbolic. An independent proof of this has been found by Clay, Rafi and Schleimer.

متن کامل

Curve - constrained drawings of planar graphs ✩ Emilio

Let C be the family of 2D curves described by concave functions, let G be a planar graph, and let L be a linear ordering of the vertices of G. L is a curve embedding of G if for any given curve Λ ∈ C there exists a planar drawing of G such that: (i) the vertices are constrained to be on Λ with the same ordering as in L, and (ii) the edges are polylines with at most one bend. Informally speaking...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1984

ISSN: 0166-218X

DOI: 10.1016/0166-218x(84)90094-5